منابع مشابه
Generation Methods of Elliptic Curves
Let q be a prime power, and let E be an elliptic curve over the field F q of q elements. As usual we associate to E a finite set called the set of rational points of E over F q. We denote this set by E(F q). We will explain these terms in Chapter 2. Once we know that E(F q) actually is a finite Abelian group, we may define the discrete logarithm problem in E(F q) as usual. However, since the us...
متن کاملSubgradient methods for convex minimization
Many optimization problems arising in various applications require minimization of an objective cost function that is convex but not di erentiable. Such a minimization arises, for example, in model construction, system identi cation, neural networks, pattern classi cation, and various assignment, scheduling, and allocation problems. To solve convex but not di erentiable problems, we have to emp...
متن کاملConvergence of Adaptive Finite Element Methods for General Second Order Linear Elliptic PDEs
We prove convergence of adaptive finite element methods (AFEM) for general (nonsymmetric) second order linear elliptic PDE, thereby extending the result of Morin et al [6, 7]. The proof relies on quasi-orthogonality, which accounts for the bilinear form not being a scalar product, together with novel error and oscillation reduction estimates, which now do not decouple. We show that AFEM is a co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Calculus of Variations and Partial Differential Equations
سال: 2017
ISSN: 0944-2669,1432-0835
DOI: 10.1007/s00526-017-1217-6